Collision Problems by an Improved Cad-based Quantiier Elimination Algorithm
نویسنده
چکیده
In 1987 Kalkbrenner and Stifter tested Collins' QE algorithm on various collision problems. In this paper we report the test results of applying Hong's improved QE algorithm on the same set of problems. The tests show that the improved QE algorithm gives signiicant speedups, ranging from 30 times to at least 7000 times.
منابع مشابه
Parallelization of Quantiier Elimination on Workstation Network
This paper reports our eeort to parallelize on a network of workstations the quantiier elimination algorithm over the reals which was devised by Collins and improved by the author. The preliminary experiments show both sub-linear and super-linear speedups due to speculative parallelism. On the problems we have tested so far, the eeciencies range between 70% and 320%.
متن کاملAn Improved Algorithm for Quantifier Elimination Over Real Closed Fields
In this paper we give a new algorithm for quanti-er elimination in the rst order theory of real closed elds that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms 3, 25, 20] the combinatorial part of the complexity of this new algorithm is independent of the number of free variables. Moreover, under the assumption that each polynom...
متن کاملOn the combinatorial and algebraic complexity of Quanti erEliminationS
In this paper we give a new algorithm for performing quantiier elimination from rst order formulae over real closed elds. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this date. A new feature of our algorithm is that the role of the algebraic part (the dependence on the degrees of the input polynomials) and the combinatorial part (the...
متن کاملQuantiier Elimination and Applications in Control
Quantiier elimination is a method for simplifying formulas that consist of polynomial equations, inequalities, and quantiiers. We give a brief introduction to this method and apply it to two problems in control theory.
متن کاملAn implementation of CAD in Maple utilising McCallum projection
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semialgebraic sets. Originally introduced by Collins in the 1970s for use in quantifier elimination it has since found numerous applications within algebraic geometry and beyond. Following from his original work in 1988, McCallum presented an improved algorithm, CADW, which offered a huge increase in the pra...
متن کامل